Structural Similarity of Vertices in Networks
نویسنده
چکیده
منابع مشابه
Providing a Link Prediction Model based on Structural and Homophily Similarity in Social Networks
In recent years, with the growing number of online social networks, these networks have become one of the best markets for advertising and commerce, so studying these networks is very important. Most online social networks are growing and changing with new communications (new edges). Forecasting new edges in online social networks can give us a better understanding of the growth of these networ...
متن کاملClustering Networks by Structures
This paper presents some new ways of uncovering underlying structures, including the roles that vertices play in the network. We begin by defining a property we call structural similarity. We then define a structure-connected cluster (SCC) as a collection of vertices they have strong structural similarity. Finally, we propose an algorithm that only finds SCCs that represent groups of peers in n...
متن کاملEnhancing community detection by local structural information
Many real-world networks such as the gene networks, protein-protein interaction networks and metabolic networks exhibit community structures, meaning the existence of groups of densely connected vertices in the networks. Many local similarity measures in the networks are closely related to the concept of the community structures, and may have positive effect on community detection in the networ...
متن کاملOrganization of complex networks without multiple connections
We find a new structural feature of equilibrium complex random networks without multiple and self-connections. We show that if the number of connections is sufficiently high, these networks contain a core of highly interconnected vertices. The number of vertices in this core varies in the range between const x N1/2 and const x N2/3, where is the number of vertices in a network. At the birth poi...
متن کاملA Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications
A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...
متن کامل